#include<stdio.h>
#include<conio.h>
#define tohop(n) n*(n-1)/2
#define in(a) printf("%d\n",Smallest(a,len1))
#define dodai(a) sizeof(a)
int len1;
int Smallest (int a[],int len)
{
	int i,j,n=tohop(len1);
	int b[n],dem=0;
	//luu cac gia tri tong vao mang 
	if (len1==1)
	goto thoat ;
	for (i=0;i<len1;i++)
	{
		for (j=i+1;j<len1;j++)
		{
			b[dem]=a[i]+a[j];
			dem++;
		}
	}
	//tim gia tri min
	int min=b[0];
	for (i=0;i<n;i++)
	{
		if (b[i]<min) min=b[i];
	}
	thoat:
		if (dem==0) return 0;
		else return min;
}
main(){
	int a[]={1},b[]={4},c[]={5,1,3,4};
	len1=sizeof(a)/sizeof(int);
	in (a);
	len1=sizeof(b)/sizeof(int);
	in(b);
	len1=sizeof(c)/sizeof(int);
	in (c);
	getch();
}
